#include <cstdio>
#include <algorithm>

using namespace std;

int a[ 1001 ];

int main( )
{
    int n, k, i, p;
    while ( scanf("%d%d", &n, &k) != EOF )
    {
        for ( i = 0; i < n; i++ )
            scanf("%d", &a[ i ]);
        sort( a, a + n );
        if ( k == 1 )
        {
            puts("Alice");
            continue;
        }
        if ( n & 1 )
        {
            p = a[ 0 ];
            for ( i = 1; i < n; i += 2 )
                p ^= a[ i + 1 ] - a[ i ] - 1;
        }
        else
        {
            p = 0;
            for ( i = 0; i < n; i += 2 )
                p ^= a[ i + 1 ] - a[ i ] - 1;
        }
        if ( n % 2 == 1 && k == 2 )
        {
            if ( p )
                puts("Bob");
            else
                puts("Alice");
        }
        else
            if ( p )
                puts("Alice");
            else
                puts("Bob");
    }
    return 0;
}
